A Set-oriented Meta-interpreter Driven by a \re- Lational" Trace for Deductive Databases Debug- Ging 1
نویسنده
چکیده
The development of deductive databases requires tools, in particular for de-bugging. Deductive databases manage large quantity of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter using substitution sets. The relational trace eeciently gives precise information about data extraction from the relational database. The meta-interpreter manages substitution sets and gives explanation on the deduction. The expensive aspects of meta-interpretation are reduced by the use of the trace which avoids many calculations. The exibility of meta-interpretation is preserved. It allows traces of diierent prooles to be easily produced.
منابع مشابه
Myrtle: A Set-Oriented Meta-Interpreter Driven by a "Relational" Trace for Deductive Databases Debugging
Deductive databases manage large quantities of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter using substitution sets. The relational trace e ciently gives precise information ...
متن کاملMyrtle : A set - oriented meta - interpreter driven by a “ relational ” trace for deductive databases
Deductive databases manage large quantities of data and, in general, in a set-oriented way. The existing systems of explanation for deductive databases do not take these constraints into account. We propose a tracing technique which consists of integrating a "relational" trace and an instrumented meta-interpreter using substitution sets. The relational trace eeciently gives precise information ...
متن کاملIn Proceedings of the International Conference on Logic Programming , 1999
Existing explanation systems for deductive databases show forests of proof trees. Although proof trees are often useful, they are only one possible interesting representation. We argue that an explanation system for deductive databases must be able to generate explanations at several levels of abstraction. One possible and well known technique to achieve this exibility is to instrument meta-int...
متن کاملIntegrity Constraints Checking In Deductive Databases
We propose a new method for integrity checking in deductive databases. The method augments a database with a set of transition and internal events rules,which explicitly define the insertions and deletions induced by a database update. Standard SLDNF resolution can then be used to check satisfaction of integrity constraints. The method has the full power of the methods developed so far, and its...
متن کاملO!-LOLA - Extending the Deductive Database System LOLA by Object-Oriented Logic Programming
This paper presents the declarative extension of the deductive database system LOLA to the object-oriented deductive database system O!-LOLA. The model used for O!-LOLA is \objects as theories", extended by state evolution. O!-LOLA combines logic programming and OO programming in two diierent w ays: First, methods are implemented as logic programs. These methods can be inherited, encapsulated a...
متن کامل